On Lipschitz optimization based on gray-box piecewise linearization

نویسندگان

  • Andreas Griewank
  • Andrea Walther
  • Sabrina Fiege
  • Torsten Bosse
چکیده

We address the problem of minimizing objectives from the class of piecewise differentiable functions whose nonsmoothness can be encapsulated in the absolute value function. They possess local piecewise linear approximations with a discrepancy that can be bounded by a quadratic proximal term. This overestimating local model is continuous but generally nonconvex. It can be generated in its abs-normal form by a minor extension of standard algorithmic differentiation tools. Here we demonstrate how the local model can be minimized by a bundle type method, which benefits from the availability of additional gray-box information via the abs-normal form. In the convex case our algorithm realizes the consistent steepest descent trajectory for which finite convergence was established in [17], specifically covering counter examples where steepest descent with exact line-search famously fails. The analysis of the abs-normal representation and the design of the optimization algorithm is geared towards the general case, whereas the convergence proof so far only covers the convex case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On stable piecewise linearization and generalized algorithmic differentiation

It is shown how functions that are defined by evaluation programs involving the absolute value function abs() (besides smooth elementals), can be approximated locally by piecewise-linear models in the style of algorithmic, or automatic, differentiation (AD). The model can be generated by a minor modification of standard AD tools [GJU96b] and it is Lipschitz continuous with respect to the base p...

متن کامل

Geometry and Combinatorics of the Cutting Angle Method

Lower approximation of Lipschitz functions plays an important role in deterministic global optimization. This article examines in detail the lower piecewise linear approximation which arises in the cutting angle method. All its local minima can be explicitly enumerated, and a special data structure was designed to process them very efficiently, improving previous results by several orders of ma...

متن کامل

New approach for attenuation correction in SPECT images, using linear optimization

Background: Photon attenuation as an inevitable physical phenomenon influences on the diagnostic information of SPECT images and results to errors in accuracy of quantitative measurements. This can be corrected via different physical or mathematical approaches. As the correction equation in mathematical approaches is nonlinear, in this study a new method of linearization called ‘Piece ...

متن کامل

Non-Lipschitz lp-Regularization and Box Constrained Model for Image Restoration

Nonsmooth nonconvex regularization has remarkable advantages for the restoration of piecewise constant images. Constrained optimization can improve the image restoration using a priori information. In this paper, we study regularized nonsmooth nonconvex minimization with box constraints for image restoration. We present a computable positive constant θ for using nonconvex nonsmooth regularizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 158  شماره 

صفحات  -

تاریخ انتشار 2016